A New Method for the Bisymmetric Minimum Norm Solution of the Consistent Matrix Equations A1XB1=C1, A2XB2=C2

نویسندگان

  • Aijing Liu
  • Guoliang Chen
  • Xiangyun Zhang
چکیده

A 2 XB 2 = C 2 , there are some valuable efforts on solving a pair of the matrix equations with certain linear constraints on solution. For instance, Khatri and Mitra [7] derived the Hermitian solution of the consistent matrix equations AX = C, XB = D. Deng et al. [8] studied the consistent conditions and the general expressions about the Hermitian solutions of the matrix equations (AX,XB) = (C,D) and designed an iterative method for its Hermitianminimum norm solutions. Peng et al. [9] presented an iterativemethod to obtain the least squares reflexive solutions of the matrix equations A 1 XB 1 =

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The (R,S)-symmetric and (R,S)-skew symmetric solutions of the pair of matrix equations A1XB1 = C1 and A2XB2 = C2

Let $Rin textbf{C}^{mtimes m}$ and $Sin textbf{C}^{ntimes n}$ be nontrivial involution matrices; i.e., $R=R^{-1}neq pm~I$ and $S=S^{-1}neq pm~I$. An $mtimes n$ complex matrix $A$ is said to be an $(R, S)$-symmetric ($(R, S)$-skew symmetric) matrix if $RAS =A$ ($ RAS =-A$). The $(R, S)$-symmetric and $(R, S)$-skew symmetric matrices have a number of special properties and widely used in eng...

متن کامل

Global least squares solution of matrix equation $sum_{j=1}^s A_jX_jB_j = E$

In this paper, an iterative method is proposed for solving matrix equation $sum_{j=1}^s A_jX_jB_j = E$. This method is based on the global least squares (GL-LSQR) method for solving the linear system of equations with the multiple right hand sides. For applying the GL-LSQR algorithm to solve the above matrix equation, a new linear operator, its adjoint and a new inner product are dened. It is p...

متن کامل

Bisymmetric and Centrosymmetric Solutions to Systems of Real Quaternion Matrix Equations

A1X = C1, A1X = C1, XB3 = C3, A2X = 62, to have bisymmetric solutions, and the system A1X = Ca, A3X B3 = C3, to have centrosymmetric solutions. The expressions of such solutions of the matrix and the systems mentioned above are also given. Moreover a criterion for a quaternion matrix to be bisymmetric is established and some auxiliary results on other sets over H are also mentioned. ~) 2005 Els...

متن کامل

The least-square bisymmetric solution to a quaternion matrix equation with applications

In this paper, we derive the necessary and sufficient conditions for the quaternion matrix equation XA=B to have the least-square bisymmetric solution and give the expression of such solution when the solvability conditions are met. Futhermore, we consider the maximal and minimal inertias of the least-square bisymmetric solution to this equation. As applications, we derive sufficient and necess...

متن کامل

Two iterative algorithms to compute the bisymmetric solution of the matrix equation

In this paper, two matrix iterative methods are presented to solve the matrix equation A1X1B1 + A2X2B2 + ... + AlXlBl = C the minimum residual problem ‖ ∑l i=1 AiX̂iBi− C‖F = minXi∈BRni×ni‖ ∑l i=1 AiXiBi−C‖F and the matrix nearness problem [X̂1, X̂2, ..., X̂l] = min[X1,X2,...,Xl]∈SE ‖[X1, X2, ..., Xl] − [X̃1, X̃2, ..., X̃l]‖F , where BRni×ni is the set of bisymmetric matrices, and SE is the solution s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Applied Mathematics

دوره 2013  شماره 

صفحات  -

تاریخ انتشار 2013